Strict Conditionals: a Negative Result

Counterfactuals as Strict Conditionals

This paper presents a new deductive argument for the strict conditional analysis of counterfactual conditionals, as against the dominant variably strict analysis due to Robert Stalnaker (1968) and David Lewis (1973). Counterfactual conditionals belong to a broader linguistic family of counterfactual modals. The argument offered here turns on facts about the logical interaction of counterfactual...

Strict p-negative type of a metric space

Doust and Weston (J Funct Anal 254:2336–2364, 2008) have introduced a new method called enhanced negative type for calculating a non-trivial lower bound ℘T on the supremal strict p-negative type of any given finite metric tree (T, d). In the context of finite metric trees any such lower bound ℘T > 1 is deemed to be nontrivial. In this paper we refine the technique of enhanced negative type and ...

STRICT p-NEGATIVE TYPE OF A SEMI-METRIC SPACE

Doust and Weston [8] introduced a new method called “enhanced negative type” for calculating a non trivial lower bound ℘T on the supremal strict p-negative type of any given finite metric tree (T, d). (In the context of finite metric trees any such lower bound ℘T > 1 is deemed to be non trivial.) In this paper we refine the technique of enhanced negative type and show how it may be applied more...

Amalgamation for Reducts of Polyadic Equality Algebras, both a Negative Result and a Positive Result

Let G ⊆ ωω be a semigroup. G polyadic algebras with equality, or simply G algebras, are reducts of polyadic algebras with equality obtained by restricting the similarity type and axiomatization of polyadic algebras to substitutions in G, and possibly weakening the axioms governing the diagonal elements. Such algebras were introduced in the context of ’finitizing’ first order logic with equality...

The negative Ramsey test: another triviality result